Linear Recurrences Under Side Conditions
نویسندگان
چکیده
منابع مشابه
Optimization of an n-Person Game Under Linear Side Conditions
This paper is concerned with n-person games which typically occur in mathematical con ict models [cf. [4], [7],[8]]. These games are so called cost-games, in which every actor tries to minimize his own costs and the costs are interlinked by a system of linear inequalities. It is shown that, if the players cooperate, i.e., minimize the sum of all the costs, they achieve a Nash Equilibrium. In or...
متن کاملDiophantine Equations Related with Linear Binary Recurrences
In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...
متن کاملMatching under Side Conditions in Description Logics
Whereas matching in Description Logics is now relatively well-investigated, there are only very few formal results on matching under additional side conditions, though these side conditions were already present in the original paper by Borgida and McGuinness introducing matching in DLs. The present paper closes this gap for the DL ALN and its sublanguages: matching under subsumption conditions ...
متن کاملLinear Recurrences via Probability
The long run behavior of a linear recurrence is investigated using standard results from probability theory. In a recent paper [1] in the American Mathematical Monthly, the authors look at several distinct approaches to studying the convergence and limit L of a sequence (xn) given by a linear recurrence. Our approach is to use probability to study the same sequence. The nth term xn of the seque...
متن کاملLecture # 27 : Linear Recurrences
1 Recurrences A linear, first order recurrence is a problem of the form x(j) = a(j)x(j − 1) + y(j), x(1) = y(1) (x(0) = 0), 1 · · · · · · · −a(2) 1 · · · · · · · −a(3) 1 · · · · · · · −a(4) 1 · · · · · · · −a(5) 1 · · · · · · · −a(6) 1 · · · · · · · −a(7) 1 · · · · · · · −a(8) 1 Such a bidiagonal system of equations corresponds to the forward solution of a system Ax = y after LU–factorization o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1980
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(80)80037-0